System and method of optimizing a fixed-route transit network

ABSTRACT

According to an aspect of the invention there is provided a method of optimizing a fixed route on a transit network, comprising the steps of: a) permitting a vehicle providing service on the fixed route to make deviations from the fixed route based on passenger requests; b) tracking the deviations and number of passenger requests corresponding to each deviation; c) submitting information from tracking step b) into a decision-making algorithm; and d) modifying the fixed route to include new stops based on results from the decision-making algorithm, as well as a system for implementing this method.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of prior U.S. patent application Ser.No. 11/443,358, filed May 31, 2006 now U.S. Pat. No. 7,391,341.

FIELD OF THE INVENTION

The present invention relates to the field of fixed route assignments ina transit network. In particular, it relates to the modification ofexisting fixed transit routes and stops using permitted deviations inthese routes and stops and processing data gathered from thesedeviations.

BACKGROUND OF THE INVENTION

Public transit networks providing transportation by buses or similarvehicles typically operate these vehicles on a fixed route. The vehiclefollows the road network along a pre-determined path, and makes stops atpredetermined locations. Furthermore, the stops are made atpre-determined times, within the standard fluctuations of traffic andweather conditions.

In many areas, these routes have been in place for many years and thetimes and locations of the stops along these routes have been in placefor a similar length of time. However, in the course of urbandevelopment in the areas along a given route, the positioning of thestops may no longer be optimal. It is thus necessary to review the stopsand routes on a periodic basis to determine if changes are required toprovide optimal service to passengers.

A problem is presented, namely, how to gather the necessary informationto develop a proper analysis of the route and stops. Passengers surveyscan be conducted, but a great deal of effort and expense must be putinto selecting the proper questions for the survey, and the generallevel of response to surveys is sufficiently low as to render theresults of dubious value. Reviewing developments along the route, suchas a new shopping or residential complex, can provide some insightregarding general locations for new stops. However, in the absence ofinformation from riders (and potential riders) any changes resultingfrom this type of review are speculative and may or may not accuratelyreflect rider habits and desires.

There is a need for a method of optimizing fixed routes on a transitnetwork which is based on data gathered from riders without the need toactually solicit the necessary data from the riders themselves.

SUMMARY OF THE INVENTION

According to an aspect of the invention there is provided a method ofoptimizing a fixed route on a transit network, comprising the steps of:a) permitting a vehicle providing service on the fixed route to makelimited deviations from the fixed route based on passenger requests; b)tracking the deviations and number of passenger requests correspondingto each deviation; c) submitting information from tracking step b) intoa decision-making algorithm; and d) modifying the fixed route to includenew stops based on results from the decision-making algorithm.Optionally, existing stops may be removed from the fixed route.Optionally, passenger requests may be received either prior to boardingor during travel.

Preferably, riders are permitted to request deviations from the courseof the route in addition to requests for deviation in stops along theroute. Thus, the modifications to the route may include changes to thecourse of the route in addition to changes in the stops.

Also preferably, the decision-making algorithm allows limitations on newand existing stops, such as maximum number of stops on a route, maximumnumber of stops on a specific section of a route, minimum distancebetween stops, and maximum distance between stops, restrictions towithin a defined polygon, or other limitations, when determiningpotential modifications to the fixed route.

According to another aspect of the invention, there is provided a systemcapable of executing the above method.

Other and further advantages and features of the invention will beapparent to those skilled in the art from the following detaileddescription thereof, taken in conjunction with the accompanyingdrawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will now be described in more detail, by way of exampleonly, with reference to the accompanying drawings, in which like numbersrefer to like elements, wherein:

FIG. 1 is a diagram of a five-stop fixed transit route;

FIG. 2 is a diagram of the transit route of FIG. 1 with an additionalstop;

FIG. 3 is a diagram of the transit route of FIG. 1 with an existing stopreplaced by a new stop;

FIG. 4 is a diagram of the transit route of FIG. 1 with an additionaldeviation added to the route;

FIG. 5 is a diagram of the transit route of FIG. 1 with an additionaldeviation added to the route and an existing stop removed;

FIG. 6 is a diagram of the inputs and outputs for a system executing themethod of determining changes to the fixed route.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The invention is a method of optimizing a fixed route in a transitnetwork, such as the five-stop (A-E) route shown in FIG. 1. The firststep is to permit the vehicle to stop at locations along the route whichare not currently designated stops in response to passenger requests toembark/disembark the vehicle. These requests are logged, preferably inconjunction with information about the number of passengersembarking/disembarking at the existing stops. It is noted that this typeof flexible stopping is already provided as a courtesy service in sometransit networks, usually with respect to night-time services, femalepassengers and/or passengers with physical disabilities.

Over time, it can become apparent that certain flexible stops are beingrequested at a high rate and possibly at a higher rate than existingstops. For example, as shown in FIG. 2, flexible stop D′, locatedbetween stops D and E, has received numerous requests. Therefore, stopD′ is added to the route. However, if, in addition, the number ofpassengers using stop D has shown a marked decrease, then the change inthe stops along the route is made by adding new stop D′ and removing oldstop D, resulting in the new route of FIG. 3.

Of course, it is possible that there will be minimal use of the flexiblestops by passengers, which could be interpreted as an indication thatthe route and stops are satisfactory in their current format.

Another use of the flexible stop method is realized if, in addition toallowing flexible stops, the route itself is permitted to be changed aswell. Again starting from the route shown in FIG. 1, passengers are nowpermitted to request a deviation from the route and not merely a changein the stop along the route. These deviations result in the addition ofnew course sections to the fixed route and the removal of existingcourse sections, if necessary. For example, as shown in FIG. 4, a newstop B′ is requested, which results in the addition of a new coursesection in the route from stop B to stop C.

As described above, over time the number of requests for stop B′ arerecorded and compared against the number of passengers using existingstop B. If sufficient requests are recorded, then stop B′ is added tothe route as shown in FIG. 4. However, if in addition to the requestsfor stop B′, the number of passengers using stop B has decreased, thenstop B may be removed as well, as shown in FIG. 5.

It can be seen that in order to successfully gather the informationabout the passengers' usage of requested and existing stops, some formof passenger and vehicle tracking and data collection is required.However, methods of doing so are known in the art and it is expectedthat any of them should prove sufficient for data collection purposes.This data is then input into a decision-making algorithm which usesuser-defined parameters to determine if stops should be added or deletedor if changes should be made to the route.

Additionally, if desired, the times at which the passenger requests aremade may be recorded. By using this additional data in the algorithm,the modifications to the route may be restricted to certain time periodsbased on the pattern of requests.

The algorithm can also include additional restrictions to apply to theassessment of new stops. Limitations on the number of stops on a route,the number of stops on a given section of the route, accessibilityrestrictions (wheel chair ramps, elevators, etc.), accommodations(covered stop, benches, etc) or even limitations (minimum or maximum) onthe distance between stops or other limitations can all be incorporatedinto the decision-making algorithm for new stops. Use of theselimitations can assist in ensuring that new stops and routes meet thesame criteria as old stops and routes.

The above method is preferably executed by a suitable equipped computersystem as shown in FIG. 6. Passenger request data, both pre-boarding(60) and post-boarding (62), as well as the passenger pick-up anddrop-off data (64) for each stop are fed into a computer 66. Thecomputer 66 then inputs the collected data into the decision-makingalgorithm and produces a modified route map and/or schedule 68.Depending on the criteria used by the decision-making algorithm,additional data, such as route limitation parameters 70, may also beinput.

Furthermore, it is contemplated that the granting of permission forpassenger requests for deviations may be implemented in any desiredfashion on the transit network. In a smaller network, deviations may bepermitted on all routes, allowing for re-assessment of the entirenetwork in one pass. In larger networks, permission may be granted on aroute-by-route basis, allowing for progressive change over time withoutoverwhelming the network with wholesale changes on all routes.

This concludes the description of a presently preferred embodiment ofthe invention. The foregoing description has been presented for thepurpose of illustration and is not intended to be exhaustive or to limitthe invention to the precise form disclosed. Many modifications andvariations are possible in light of the above teaching and will beapparent to those skilled in the art. It is intended the scope of theinvention be limited not by this description but by the claims thatfollow.

1. A method of optimizing a fixed route on a transit network, comprisingthe steps of: a) permitting a vehicle providing service on said fixedroute to make deviations from said fixed route based on passengerrequests for said deviations received from passengers on said vehicle;b) tracking said deviations and the number of said passenger requestscorresponding to each deviation; c) submitting information from saidtracking step b) into a decision-making algorithm executing on acomputer system; and d) modifying said fixed route to include new stopsbased on results from said decision-making algorithm.
 2. The method ofclaim 1, wherein said step of modifying said fixed route furtherincludes deleting existing stops from said fixed route.
 3. The method ofclaim 1, wherein said passenger requests include requests for changes instop locations along said fixed route.
 4. The method of claim 1, whereinsaid passenger requests include requests for changes in course alongsaid fixed route.
 5. The method of claim 4, wherein said step ofmodifying said fixed route further includes changing said course forsaid fixed route to include locations defined by said deviations.
 6. Themethod of claim 1, wherein said decision-making algorithm includeslimitations on new and existing stops, including one or more of: maximumnumber of stops on a route, maximum number of stops on a specificsection of a route, minimum distance between stops, and maximum distancebetween stops.
 7. The method of claim 1, wherein said tracking step b)includes tracking times corresponding to said passenger requests suchthat modifications to said fixed route from step d) take place onlyduring defined time periods.
 8. A method of optimizing a fixed route ona transit network, comprising the steps of: a) permitting a vehicleproviding service on said fixed route to make deviations from said fixedroute based on passenger requests for said deviations made while ridingsaid vehicle, said deviations including changes in stop locations andchanges in course along said fixed route; b) tracking said deviationsand the number of said passenger requests corresponding to eachdeviation; c) submitting information from said tracking step b) into adecision-making algorithm executing on a computer system; and d)modifying said fixed route to include changes to stop locations andchanges in said course of said fixed route based on results from saiddecision-making algorithm.
 9. A system for optimizing a fixed route on atransit network, comprising: a) a database containing informationconcerning deviations on said fixed route and the number of passengerrequests corresponding to each deviation received from passengers onvehicles performing fixed transit routes; and b) a data processing unitfor analyzing said information with respect to one of said fixed transitroutes and determining which modifications, if any, are to be made tosaid one of said fixed transit routes.
 10. The system of claim 9,wherein said data processing unit is additionally capable of analyzingmultiple ones of said fixed transit routes in combination to determinewhich modifications, if any, are to be made to each of said multipleones of said fixed transit routes.
 11. The system of claim 9, whereinsaid modifications to said fixed route include one or more of: addingnew stops, removing existing stops, add new course sections, andremoving existing course sections.
 12. A method of optimizing a fixedroute on a transit network, comprising the steps of: registeringdeviations made by a vehicle providing service in response to passengerrequests for said deviations received from passengers on said vehicle,and the number of said passenger requests corresponding to eachdeviation; processing said deviations and the number of passengerrequests corresponding to each deviation using a decision-makingalgorithm executing on a computer system; and modifying said fixed routeto include new stops based on results from said decision makingalgorithm.
 13. The method of claim 12, wherein said step of modifyingsaid fixed route further includes deleting existing stops from saidfixed route.
 14. The method of claim 12, wherein said passenger requestsinclude requests for changes in stop locations along said fixed route.15. The method of claim 12, wherein said passenger requests includerequests for changes in course along said fixed route.
 16. The method ofclaim 15, wherein said step of modifying said fixed route furtherincludes changing said course for said fixed route to include locationsdefined by said deviations.
 17. The method of claim 12, wherein saiddecision-making algorithm includes limitations on new and existingstops, including one or more of: maximum number of stops on a route,maximum number of stops on a specific section of a route, minimumdistance between stops, and maximum distance between stops.
 18. Themethod of claim 12, wherein said registering includes registering timescorresponding to said passenger requests such that modifications to saidfixed route take place only during defined time periods.
 19. A method ofoptimizing a fixed route on a transit network, comprising the steps of:registering deviations made by a vehicle providing service in responseto passenger requests for said deviations received from passengers onsaid vehicle, and the number of said passenger requests corresponding toeach deviation, said deviations including changes in stop locations andchanges in course along said fixed route; processing said deviations andthe number of passenger requests corresponding to each deviation using adecision-making algorithm executing on a computer system; and modifyingsaid fixed route to include new stops based on results from saiddecision making algorithm.